A HEURISTIC FOR TWO MACHINE OPEN SHOP SPECIALLY STRUCTURED SCHEDULING PROBLEM TO MINIMIZE THE RENTAL COST, INCLUDING JOB BLOCK CRITERIA

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Two Stages Specially Structured Flow Shop Scheduling: Minimize the Rental Cost with Independent Setup Time

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

متن کامل

Heuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...

متن کامل

Minimizing Rental Cost under Specified Rental Policy in Two Stage Open shop Scheduling Problem

This Paper is an attempt to study two stage open shop scheduling problem in which processing time of the jobs are given. The objective of the paper is to obtain an algorithm to minimize the rental cost of the machines in two stage open shop scheduling problem under specified rental policy. A numerical illustration is given to justify the proposed algorithm.

متن کامل

Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

This Article is brought to you for free and open access by the Engineering Management & Systems Engineering at ODU Digital Commons. It has been accepted for inclusion in Engineering Management & Systems Engineering Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. Repository Citation Salem, Mohammed Al; Bedoy...

متن کامل

A Heuristic for the Job Shop Scheduling Problem

Multistart local search heuristics Remove and Reinsert that is based on a simple schedule constructing heuristics is tested on several benchmark instances of the job shop scheduling problem. The heuristics provides very good near optimal solutions within reasonably short computation time. The implementation within a plant simulation software is compared to the build-in genetic algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Pure and Apllied Mathematics

سال: 2013

ISSN: 1311-8080,1314-3395

DOI: 10.12732/ijpam.v86i5.1